0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n001.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:56:34 EDT 2025
0.12/0.33	% CPUTime    : 
0.19/0.47	Running higher-order theorem proving
0.19/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.SkhIJct0NN/E---3.1_30495.p
0.19/0.50	# Version: 3.0.0-ho
0.19/0.50	# Preprocessing class: HSSSSLSSSLMNSFN.
0.19/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.50	# Starting ho_unfolding_6 with 1200s (5) cores
0.19/0.50	# Starting pre_casc_5 with 240s (1) cores
0.19/0.50	# Starting sh4l with 240s (1) cores
0.19/0.50	# Starting full_lambda_3 with 240s (1) cores
0.19/0.50	# pre_casc_5 with pid 30574 completed with status 0
0.19/0.50	# Result found by pre_casc_5
0.19/0.50	# Preprocessing class: HSSSSLSSSLMNSFN.
0.19/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.50	# Starting ho_unfolding_6 with 1200s (5) cores
0.19/0.50	# Starting pre_casc_5 with 240s (1) cores
0.19/0.50	# SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
0.19/0.50	# Search class: HHUSF-FFSF21-DSFFMFBN
0.19/0.50	# partial match(2): HHUSF-FFSF21-SSFFMFNN
0.19/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.19/0.50	# Starting new_ho_10 with 130s (1) cores
0.19/0.50	# new_ho_10 with pid 30577 completed with status 10
0.19/0.50	# Starting pre_casc_5 with 25s (1) cores
0.19/0.50	# pre_casc_5 with pid 30585 completed with status 0
0.19/0.50	# Result found by pre_casc_5
0.19/0.50	# Preprocessing class: HSSSSLSSSLMNSFN.
0.19/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.50	# Starting ho_unfolding_6 with 1200s (5) cores
0.19/0.50	# Starting pre_casc_5 with 240s (1) cores
0.19/0.50	# SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
0.19/0.50	# Search class: HHUSF-FFSF21-DSFFMFBN
0.19/0.50	# partial match(2): HHUSF-FFSF21-SSFFMFNN
0.19/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.19/0.50	# Starting new_ho_10 with 130s (1) cores
0.19/0.50	# new_ho_10 with pid 30577 completed with status 10
0.19/0.50	# Starting pre_casc_5 with 25s (1) cores
0.19/0.50	# Preprocessing time       : 0.001 s
0.19/0.50	
0.19/0.50	# Proof found!
0.19/0.50	# SZS status Theorem
0.19/0.50	# SZS output start CNFRefutation
0.19/0.50	thf(decl_23, type, in: $i > $i > $o).
0.19/0.50	thf(decl_24, type, setunion: $i > $i).
0.19/0.50	thf(decl_25, type, dsetconstr: $i > ($i > $o) > $i).
0.19/0.50	thf(decl_26, type, singleton: $i > $o).
0.19/0.50	thf(decl_27, type, iffalseProp1: $o).
0.19/0.50	thf(decl_28, type, ifSingleton: $o).
0.19/0.50	thf(decl_29, type, if: $i > $o > $i > $i > $i).
0.19/0.50	thf(decl_30, type, theeq: $o).
0.19/0.50	thf(decl_31, type, esk1_0: $i).
0.19/0.50	thf(decl_32, type, epred1_0: $o).
0.19/0.50	thf(decl_33, type, esk2_0: $i).
0.19/0.50	thf(decl_34, type, esk3_0: $i).
0.19/0.50	thf(decl_38, type, esk7_0: $i).
0.19/0.50	thf(ifSingleton, axiom, ((ifSingleton)<=>![X1:$i, X2:$o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(singleton @ (dsetconstr @ X1 @ (^[X5:$i]:((((X2)&((X5)=(X3)))|(~((X2))&((X5)=(X4))))))))))))), file('/export/starexec/sandbox/tmp/tmp.SkhIJct0NN/E---3.1_30495.p', ifSingleton)).
0.19/0.50	thf(if, axiom, ((if)=(^[X1:$i, X2:$o, X3:$i, X4:$i]:(setunion @ (dsetconstr @ X1 @ (^[X5:$i]:((((X2)&((X5)=(X3)))|(~((X2))&((X5)=(X4)))))))))), file('/export/starexec/sandbox/tmp/tmp.SkhIJct0NN/E---3.1_30495.p', if)).
0.19/0.50	thf(iffalseProp1, axiom, ((iffalseProp1)<=>![X1:$i, X2:$o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(~((X2))=>(in @ X4 @ (dsetconstr @ X1 @ (^[X5:$i]:((((X2)&((X5)=(X3)))|(~((X2))&((X5)=(X4)))))))))))))), file('/export/starexec/sandbox/tmp/tmp.SkhIJct0NN/E---3.1_30495.p', iffalseProp1)).
0.19/0.50	thf(iffalse, conjecture, ((iffalseProp1)=>((![X1:$i, X2:$o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((~((X2))=>((if @ X1 @ ((X2)) @ X3 @ X4)=(X4)))<=(in @ X4 @ X1)))))<=(theeq))<=(ifSingleton))), file('/export/starexec/sandbox/tmp/tmp.SkhIJct0NN/E---3.1_30495.p', iffalse)).
0.19/0.50	thf(theeq, axiom, ((theeq)<=>![X6:$i]:(((singleton @ X6)=>![X3:$i]:(((in @ X3 @ X6)=>((setunion @ X6)=(X3))))))), file('/export/starexec/sandbox/tmp/tmp.SkhIJct0NN/E---3.1_30495.p', theeq)).
0.19/0.50	thf(c_0_5, plain, ((ifSingleton)<=>![X1:$i, X2:$o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(singleton @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X2)&((Z0)=(X3)))|(~((X2))&((Z0)=(X4))))))))))))), inference(fof_simplification,[status(thm)],[ifSingleton])).
0.19/0.50	thf(c_0_6, plain, ((if)=(^[Z0/* 19 */:$i, Z1:$o, Z2:$i, Z3:$i]:(setunion @ (dsetconstr @ Z0 @ (^[Z4/* 9 */:$i]:((((Z1)&((Z4)=(Z2)))|(~((Z1))&(Z4))))))))), inference(fof_simplification,[status(thm)],[if])).
0.19/0.50	thf(c_0_7, plain, ((iffalseProp1)<=>![X1:$i, X2:$o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(~((X2))=>(in @ X4 @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X2)&((Z0)=(X3)))|(~((X2))&((Z0)=(X4)))))))))))))), inference(fof_simplification,[status(thm)],[iffalseProp1])).
0.19/0.50	thf(c_0_8, negated_conjecture, ~((![X21:$i, X22:$o, X23:$i]:(((in @ X23 @ X21)=>![X24:$i]:(((in @ X24 @ X21)=>(~(X22)=>(in @ X24 @ (dsetconstr @ X21 @ (^[Z0/* 9 */:$i]:((((X22)&((Z0)=(X23)))|(~((X22))&((Z0)=(X24)))))))))))))=>(![X27:$i, X28:$o, X29:$i]:(((in @ X29 @ X27)=>![X30:$i]:(((in @ X30 @ X27)=>(singleton @ (dsetconstr @ X27 @ (^[Z0/* 9 */:$i]:((((X28)&((Z0)=(X29)))|(~((X28))&((Z0)=(X30))))))))))))=>(![X25:$i]:(((singleton @ X25)=>![X26:$i]:(((in @ X26 @ X25)=>((setunion @ X25)=(X26))))))=>![X1:$i, X2:$o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(~(X2)=>((setunion @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X2)&((Z0)=(X3)))|(~((X2))&((Z0)=(X4))))))))=(X4))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[iffalse]), c_0_5]), c_0_6]), c_0_7]), theeq])])).
0.19/0.50	thf(c_0_9, negated_conjecture, ![X31:$i, X32:$o, X33:$i, X34:$i, X35:$i, X36:$o, X37:$i, X38:$i, X39:$i, X40:$i]:(((~(in @ X33 @ X31)|(~(in @ X34 @ X31)|((X32)|(in @ X34 @ (dsetconstr @ X31 @ (^[Z0/* 9 */:$i]:((((X32)&((Z0)=(X33)))|(~((X32))&((Z0)=(X34)))))))))))&((~(in @ X37 @ X35)|(~(in @ X38 @ X35)|(singleton @ (dsetconstr @ X35 @ (^[Z0/* 9 */:$i]:((((X36)&((Z0)=(X37)))|(~((X36))&((Z0)=(X38))))))))))&((~(singleton @ X39)|(~(in @ X40 @ X39)|((setunion @ X39)=(X40))))&((in @ esk2_0 @ esk1_0)&((in @ esk3_0 @ esk1_0)&(~(epred1_0)&((setunion @ (dsetconstr @ esk1_0 @ (^[Z0/* 9 */:$i]:((((epred1_0)&((Z0)=(esk2_0)))|(~((epred1_0))&((Z0)=(esk3_0))))))))!=(esk3_0))))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])).
0.19/0.50	thf(c_0_10, negated_conjecture, ![X3:$i, X1:$i]:((((setunion @ X1)=(X3))|~((singleton @ X1))|~((in @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.50	thf(c_0_11, negated_conjecture, ![X2:$o, X1:$i, X4:$i, X3:$i]:(((singleton @ (dsetconstr @ X3 @ (^[Z0/* 9 */:$i]:((((X2)&((Z0)=(X1)))|(~((X2))&((Z0)=(X4))))))))|~((in @ X1 @ X3))|~((in @ X4 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.50	thf(c_0_12, negated_conjecture, ![X1:$i, X4:$i, X3:$i]:(((in @ X4 @ (dsetconstr @ X3 @ (^[Z0/* 9 */:$i]:(((~($true)&((Z0)=(X1)))|(~(~($true))&((Z0)=(X4))))))))|~((in @ X1 @ X3))|~((in @ X4 @ X3)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9])])])).
0.19/0.50	thf(c_0_13, negated_conjecture, ![X2:$o, X5:$i, X4:$i, X3:$i, X1:$i]:((((setunion @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X2)&((Z0)=(X3)))|(~((X2))&((Z0)=(X4))))))))=(X5))|~((in @ X5 @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X2)&((Z0)=(X3)))|(~((X2))&((Z0)=(X4)))))))))|~((in @ X4 @ X1))|~((in @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.19/0.50	thf(c_0_14, negated_conjecture, ![X1:$i, X4:$i, X3:$i]:(((in @ X1 @ (dsetconstr @ X3 @ (^[Z0/* 3 */:$i]:(((Z0)=(X1))))))|~((in @ X1 @ X3))|~((in @ X4 @ X3)))), inference(cn,[status(thm)],[c_0_12])).
0.19/0.50	thf(c_0_15, negated_conjecture, ((setunion @ (dsetconstr @ esk1_0 @ (^[Z0/* 9 */:$i]:((((epred1_0)&((Z0)=(esk2_0)))|(~((epred1_0))&((Z0)=(esk3_0))))))))!=(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.50	thf(c_0_16, plain, ![X2:$o, X4:$i, X5:$i, X3:$i, X1:$i]:((((setunion @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X2)&((Z0)=(X3)))|(~((X2))&((Z0)=(X4))))))))=(X5))|((^[Z0/* 9 */:$i]:((((X2)&((Z0)=(X3)))|(~((X2))&((Z0)=(X4))))))!=(^[Z0/* 3 */:$i]:(((Z0)=(X5)))))|~((in @ X4 @ X1))|~((in @ X3 @ X1))|~((in @ X5 @ X1)))), inference(condense,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_13, c_0_14])])])])).
0.19/0.50	thf(c_0_17, negated_conjecture, (in @ esk3_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.50	thf(c_0_18, negated_conjecture, (in @ esk2_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.50	thf(c_0_19, negated_conjecture, ((^[Z0/* 9 */:$i]:((((epred1_0)&((Z0)=(esk2_0)))|(~((epred1_0))&((Z0)=(esk3_0))))))!=(^[Z0/* 3 */:$i]:(((Z0)=(esk3_0))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17]), c_0_18])])]), c_0_17])])).
0.19/0.50	thf(c_0_20, negated_conjecture, ((((epred1_0)&((esk7_0)=(esk2_0)))|(~((epred1_0))&((esk7_0)=(esk3_0))))<~>((esk7_0)=(esk3_0))), inference(neg_ext,[status(thm)],[c_0_19])).
0.19/0.50	thf(c_0_21, negated_conjecture, ~((epred1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.50	thf(c_0_22, negated_conjecture, ((esk3_0)!=(esk7_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_20])]), c_0_21])).
0.19/0.50	thf(c_0_23, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_20])]), c_0_21]), c_0_22]), ['proof']).
0.19/0.50	# SZS output end CNFRefutation
0.19/0.50	# Parsed axioms                        : 13
0.19/0.50	# Removed by relevancy pruning/SinE    : 8
0.19/0.50	# Initial clauses                      : 7
0.19/0.50	# Removed in clause preprocessing      : 0
0.19/0.50	# Initial clauses in saturation        : 7
0.19/0.50	# Processed clauses                    : 48
0.19/0.50	# ...of these trivial                  : 0
0.19/0.50	# ...subsumed                          : 6
0.19/0.50	# ...remaining for further processing  : 41
0.19/0.50	# Other redundant clauses eliminated   : 8
0.19/0.50	# Clauses deleted for lack of memory   : 0
0.19/0.50	# Backward-subsumed                    : 7
0.19/0.50	# Backward-rewritten                   : 0
0.19/0.50	# Generated clauses                    : 94
0.19/0.50	# ...of the previous two non-redundant : 78
0.19/0.50	# ...aggressively subsumed             : 0
0.19/0.50	# Contextual simplify-reflections      : 0
0.19/0.50	# Paramodulations                      : 53
0.19/0.50	# Factorizations                       : 0
0.19/0.50	# NegExts                              : 4
0.19/0.50	# Equation resolutions                 : 8
0.19/0.50	# Disequality decompositions           : 0
0.19/0.50	# Total rewrite steps                  : 8
0.19/0.50	# ...of those cached                   : 0
0.19/0.50	# Propositional unsat checks           : 0
0.19/0.50	#    Propositional check models        : 0
0.19/0.50	#    Propositional check unsatisfiable : 0
0.19/0.50	#    Propositional clauses             : 0
0.19/0.50	#    Propositional clauses after purity: 0
0.19/0.50	#    Propositional unsat core size     : 0
0.19/0.50	#    Propositional preprocessing time  : 0.000
0.19/0.50	#    Propositional encoding time       : 0.000
0.19/0.50	#    Propositional solver time         : 0.000
0.19/0.50	#    Success case prop preproc time    : 0.000
0.19/0.50	#    Success case prop encoding time   : 0.000
0.19/0.50	#    Success case prop solver time     : 0.000
0.19/0.50	# Current number of processed clauses  : 32
0.19/0.50	#    Positive orientable unit clauses  : 8
0.19/0.50	#    Positive unorientable unit clauses: 0
0.19/0.50	#    Negative unit clauses             : 5
0.19/0.50	#    Non-unit-clauses                  : 19
0.19/0.50	# Current number of unprocessed clauses: 35
0.19/0.50	# ...number of literals in the above   : 220
0.19/0.50	# Current number of archived formulas  : 0
0.19/0.50	# Current number of archived clauses   : 9
0.19/0.50	# Clause-clause subsumption calls (NU) : 276
0.19/0.50	# Rec. Clause-clause subsumption calls : 61
0.19/0.50	# Non-unit clause-clause subsumptions  : 2
0.19/0.50	# Unit Clause-clause subsumption calls : 17
0.19/0.50	# Rewrite failures with RHS unbound    : 0
0.19/0.50	# BW rewrite match attempts            : 8
0.19/0.50	# BW rewrite match successes           : 6
0.19/0.50	# Condensation attempts                : 48
0.19/0.50	# Condensation successes               : 1
0.19/0.50	# Termbank termtop insertions          : 6861
0.19/0.50	# Search garbage collected termcells   : 413
0.19/0.50	
0.19/0.50	# -------------------------------------------------
0.19/0.50	# User time                : 0.013 s
0.19/0.50	# System time              : 0.004 s
0.19/0.50	# Total time               : 0.017 s
0.19/0.50	# Maximum resident set size: 1888 pages
0.19/0.50	
0.19/0.50	# -------------------------------------------------
0.19/0.50	# User time                : 0.013 s
0.19/0.50	# System time              : 0.008 s
0.19/0.50	# Total time               : 0.020 s
0.19/0.50	# Maximum resident set size: 1720 pages
0.19/0.50	% E exiting
0.19/0.50	% E exiting
0.19/0.50	EOF